Wireless communication methods and apparatus

ABSTRACT

In an embodiment a wireless relay device comprises a receiver configured to receive signals from at least a first wireless device and a second wireless device, and to extract, from a signal received from the first wireless device, an indication of a path metric for a path from a source node to the first wireless device, and from a signal received from the second wireless device, an indication of a path metric for a path from the source node to the second wireless device; a processor configured to select, using the extracted indications, a path from the source node to the wireless relay device and to determine a path metric for the selected path; a memory configured to store the path metric for the selected path; and a transmitter configured to transmit an indication of the path metric for the selected path to a third wireless device.

CROSS REFERENCE TO RELATED APPLICATION(S)

This application is based upon and claims the benefit of priority fromUK Patent Application GB1205465.6 filed on 28 Mar. 2012; the entirecontents of which is incorporated herein by reference.

FIELD

Embodiments described herein relate generally wireless communicationsvia a relay node in a wireless communication network, and to routeselection in such a network.

BACKGROUND

Machine to machine (M2M) communications is an emerging communicationparadigm that has found applications in smart gird and vehicularcommunications.

Multi-hop relay networks have been identified as a network structurecapable of accommodating the ever increasing demand of informationexchange over a large number of nodes in M2M communications. Inmulti-hop relay networks, one or several intermediate relay nodes areemployed to receive the information from the source node and thenforward it to the other relay nodes or the destination node.

In some multi-hop relay networks, the relay nodes simply amplify thesignals from the source node or from the other relay nodes with a fixedgain, and then forward the amplified information to the other relays orthe destination. Such a relay technique is referred to as the“fixed-gain amplify-and-forward” technique. In the case when thereceived signals at the relays are amplified by a gain that depends onthe instantaneous power of the channel, the transmission protocol isreferred to as “variable-gain amplify-and-forward”. In other relaysystems, the received signals are detected, re-encoded, and thenforwarded at the relay nodes. Such a relay protocol is referred to as“decode-and-forward”. It is known that decode-and-forward yields abetter performance than amplify-and-forward, while subject to a highercomplexity at the relay nodes. In some application scenarios wheresimple relay nodes are desired, amplify-and-forward, especiallyfixed-gain amplify-and-forward techniques are more attractive.

With an ever increasing demand of information exchange over a hugenumber of nodes, M2M communications faces a number of challengesincluding how to select, among all possible transmission routes, thebest route for signal transmission from the source to the destination.Intuitively, assuming channel state information (CSI) of all thetransmission links is known at each node, an exhaustive search over allthe possible routes can be performed to find the optimum route. However,this is not feasible in practice because of the prohibitive complexityintroduced as the number of relays as the number of hops increases.

BRIEF DESCRIPTION OF THE DRAWINGS

In the following, embodiments are described, by way of example only,with reference to the accompanying drawings in which:

FIG. 1 illustrates a multi-hop relay network according to an embodiment;

FIG. 2 illustrates a multi-hop relay network according to an embodimentshowing parameters indicating effective gain for channels between stagesand an indication of a scaled noise power at each stage;

FIGS. 3 a-3 g illustrate steps in a method of selecting a path from asource node to a destination node according to an embodiment;

FIG. 4 is a schematic of a wireless relay node according to anembodiment;

FIG. 5 is a flowchart of a method of selecting a path in a wirelessnetwork according to an embodiment;

FIG. 6 is a graph showing the number of comparisons required fordifferent numbers of hops for exhaustive search and the path selectionalgorithm used in embodiments;

FIG. 7 illustrates the number of comparisons required for differentnumbers of nodes per stage for exhaustive search and the path selectionalgorithm used in embodiments; and

FIG. 8 illustrates the outage probability for paths selected byembodiments compared with the outage probability for paths selected byan exhaustive search.

DETAILED DESCRIPTION

In an embodiment, a wireless relay device comprises a receiverconfigured to receive signals from at least a first wireless device anda second wireless device, and to extract, from a signal received fromthe first wireless device, an indication of a path metric for a pathfrom a source node to the first wireless device, and from a signalreceived from the second wireless device, an indication of a path metricfor a path from the source node to the second wireless device; aprocessor configured to select, using the extracted indications, a pathfrom the source node to the wireless relay device and to determine apath metric for the selected path; a memory configured to store the pathmetric for the selected path; and a transmitter configured to transmitan indication of the path metric for the selected path to a thirdwireless device.

In an embodiment, the processor is configured to use the extractedindications to determine, an optimal path, from a set of pathscomprising the path from the source node to the wireless relay devicevia the first wireless device and the path from the source node to thewireless relay device via the second wireless device, and to select theoptimal path.

In an embodiment, the processor is configured to use indications ofchannel state information for, respectively, a path between the firstwireless device and the wireless relay device, and a path between thesecond wireless device and the wireless relay device and the extractedindications to select a path from the source node to the wireless relaydevice.

In an embodiment, the processor is configured to use indications of theeffective gain for, respectively, a path between the first wirelessdevice and the wireless relay device, and a path between the secondwireless device and the wireless relay device and the extractedindications to select a path from the source node to the wireless relaydevice.

In an embodiment, the processor is configured to determine the pathmetric for the selected path as the effective gain for the path from oneof the first and the second wireless device to the wireless relay devicemultiplied by the path metric for the path from the source node to theone of the first and the second wireless device minus a quantityproportional to the noise power on the wireless relay device.

In an embodiment, the processor is configured to calculate a set ofproducts, the set of products comprising for each of the first and thesecond wireless device the product of the effective channel gain for thepath from the wireless device to the wireless relay device multipliedwith the path metric for the path from the source node to that wirelessdevice, to compare the products of the set of products to determine alargest product, and to select the path having the largest product asthe selected path.

In an embodiment, the wireless relay device is configured as anamplify-and-forward wireless relay device.

In an embodiment, the wireless relay device is configured as a fixedgain amplify-and-forward wireless relay device.

In an embodiment a wireless network comprises a source node; adestination node; and a plurality of wireless relay devices according toembodiments, wherein the destination node is configured to receiveindications of path metrics from at least a first wireless relay deviceand a second wireless relay device of the plurality of wireless relaydevices; and determine, using the received path metrics, an optimal pathfrom the source node to the destination node.

In an embodiment, the wireless network is configured to send a messagealong the optimal path from the source node to the destination node.

In an embodiment, a wireless communication method comprises receiving,at a wireless relay device, signals from at least a first wirelessdevice and a second wireless device, wherein a signal received from thefirst wireless device comprises an indication of a path metric for apath from a source node to the first wireless device and a signalreceived from the second wireless device comprises an indication of apath metric for a path from the source node to the second wirelessdevice; using the indications received from the first wireless deviceand the second wireless device to select a path from the set of pathscomprising the path from the source node to the wireless relay devicevia the first wireless device and the path from the source node to thewireless relay device via the second wireless device; determining a pathmetric for the selected path; and transmitting an indication of the pathmetric for the selected path to a third wireless device.

In an embodiment the wireless communication method according comprisesdetermining an optimal path from the set of paths and selecting theoptimal path.

In an embodiment, determining a path metric for the selected pathcomprises multiplying the effective gain for the path from one of thefirst and the second wireless device to the wireless relay device by thepath metric for the path from the source node to the one of the firstand the second wireless device and subtracting a quantity proportionalto the noise power on the wireless relay device.

In an embodiment, selecting a path comprises calculating a set ofproducts, the set of products comprising for each of the first and thesecond wireless device the product of the effective channel gain for thepath from the wireless device to the wireless relay multiplied with thepath metric for the path from the source node to that wireless device,comparing the products of the set of products to determine a maximumproduct, and selecting the path having the maximum product.

In an embodiment, a method of selecting a path from a source node to adestination node in a wireless network comprises: at a first relay node,determining a maximum path metric for paths from the source node to thefirst relay node, selecting the path having the maximum path metric asan optimum path from the source node to the first relay node, at asecond relay node, determining a maximum path metric for paths from thesource node to the second relay node, selecting the path having themaximum path metric as an optimum path from the source node to thesecond relay node, receiving an indication of the path metric for theoptimum path from the source node to the first relay node and anindication of the path metric for the optimum path from the source nodeto the second relay node at the destination node; determining, at thedestination node, the path from the source node to the destination nodehaving the maximum path metric using the indication of the path metricfor the optimum path from the source node to the first relay node andthe indication of the path metric for the optimum path from the sourcenode to the second relay node at the destination node; and selecting thepath having the maximum path metric as the optimum path from the sourcenode to the destination node.

In an embodiment, the method further comprises transmitting a messagealong the optimum path.

One embodiment provides a computer program product comprising computerexecutable instructions which, when executed by a processor, cause theprocessor to perform a method as set out above. The computer programproduct may be embodied in a carrier medium, which may be a storagemedium or a signal medium. A storage medium may include optical storagemeans, or magnetic storage means, or electronic storage means.

The described embodiments can be incorporated into a specific hardwaredevice, a general purpose device configured by suitable software, or acombination of both. Aspects can be embodied in a software product,either as a complete software implementation, or as an add-on componentfor modification or enhancement of existing software (such as a plugin). Such a software product could be embodied in a carrier medium, suchas a storage medium (e.g. an optical disk or a mass storage memory suchas a FLASH memory) or a signal medium (such as a download). Specifichardware devices suitable for the embodiment could include anapplication specific device such as an ASIC, an FPGA or a DSP, or otherdedicated functional hardware means. The reader will understand thatnone of the foregoing discussion of embodiment in software or hardwarelimits future implementation of the invention on yet to be discovered ordefined means of execution.

FIG. 1 shows an embodiment of a multi-hop relay network 100. The network100 has a source node 102, a destination node 104 and four relay stages.At each relay stage there are four relay nodes 106. In this embodimentthe relay protocol is amplify-and-forward. Embodiments of the presentinvention relate to methods for finding an optimal path from the sourcenode 102 to the destination node 104 such that the outage probability isminimised.

The multi-hop network shown in FIG. 1 may be generalised to an M-hoprelay system with M−1 relay stages. At each stage, there are multiple(for example, L) relay nodes. The problem of finding the optimal pathfrom the source to the destination is then finding the optimal path,among the I=L^(M-1) paths, such that the outage probability, given by

P _(out) =Pr(γ_(e2e)≦γ_(th))  (1)

is minimized, where γ_(e2e) is the end-to-end SNR for the selectedroute, and γ_(th) is a predefined threshold. Selecting the route withthe minimum outage probability is therefore equivalent to selecting theroute with the maximum end-to-end SNR, i.e., the ith route is selectedsuch that

γ^((i))=max(γ⁽¹⁾,γ⁽²⁾, . . . ,γ⁽¹⁾)  (2)

where γ^((i)) is the end-to-end SNR for the ith path.

For a given route i, the end-to-end SNR from the source to thedestination is given by

$\begin{matrix}{\gamma^{(i)} = {\frac{\prod\limits_{m = 1}^{M}\; \left( {A_{m - 1}^{(i)}{h_{m}^{(i)}}} \right)^{2}}{\sum\limits_{m = 1}^{M}\; {\rho_{m}^{(i)}{\prod\limits_{j = {m + 1}}^{M}\; \left( {A_{j - 1}^{(i)}{h_{j}^{(i)}}} \right)^{2}}}}\overset{\_}{\gamma}}} & (3)\end{matrix}$

In the equation above, ρ_(m) ^((i))=N_(m) ^((i)) γ, where N_(m) ^((i))is the power of the white Gaussian noise on the node that consists theith path at the mth stage, and γ is the average SNR per hop.

In addition, h_(m) ^((i)) is the channel on the ith path between the(m−1)th stage and the mth stage. h^((i)) _(m) is a complex numberdefining the channel transfer characteristic. It may be considered to bethe impulse response of a flat-fading system if time dispersion of thetransmitted signal is not encountered.

Embodiments can be extended to frequency-selective fading systems byusing suitable multi-carrier methods, such as orthogonalfrequency-division multiplexing (OFDM). In this case, each subcarriermay be considered independently when performing relaying, or h^((i))_(m) may be taken to be a norm of the channel impulse response or,equivalently, a norm of the channel frequency response. It is noted thata norm can be used since phase information is not required, onlyamplitude information.

A_(m) ^((i)) is the corresponding amplification factor at the mth stage.When an amplify and forward protocol is used, the wireless node at themth stage of the ith path scales the amplitude of the message by thisfactor prior to transmitting it to the wireless node at the (m+1)thstage. This amplification can be accomplished in a number of ways, forexample, an analogue operational amplifier circuit may be used, or thesignal may be digitally scaled prior to digital to analogue conversion.The amplification factors may be specified according to a number ofdifferent methods. Two examples of such methods are variable gainamplify and forward and fixed gain amplify and forward.

In an embodiment, a fixed-gain amplify-and-forward protocol is used andthe amplification factor is given by:

$\begin{matrix}{A_{m}^{(i)} = \frac{1}{\sqrt{{E{h_{m}^{{(i)}2}}} + N_{m}^{(i)}}}} & (4)\end{matrix}$

where E denotes expectation.

In the following, the quantities X^((i)) _(m) and σ(i)_(m) are definedand it is shown that γ^((i)) can be determined from these quantities.

Let

X _(m) ^((i))=(A _(m−1) ^((i)) |h _(m) ^((i))|)²  (5)

and

σ_(m) ^((i)) =N _(m) ^((i))γ_(th)  (6)

X^((i)) _(m) is the equivalent gain of the channel, taking into accountthe amplification factor applied at the previous stage and the channelthrough which the amplified signal is conveyed. In an embodiment X^((i))_(m) is computed as stated in the above. In an alternative embodiment,in which information of the amplification factor from the previous stageis unknown, the receiver relay node may use a pilot signal to estimateX^((i)) _(m).σ^((i)) _(m) is a scaled version of the noise power at the mth relay onthe ith path. This is determined by multiplying the outage thresholdγ_(th) by the actual noise variance, which can be estimated at each nodeindependently. The outage threshold γ_(th) is a design parameter.

Equation (3) above can be rearranged to show that for a given path(e.g., the ith path), the probability that γ^((i)) is smaller than orequal to a predefined threshold is given by

$\begin{matrix}{{P\left( {\gamma^{(i)} \leq \gamma_{th}} \right)} = {{P\left( {{{\prod\limits_{m = 1}^{M}\; X_{m}^{(i)}} - {\sum\limits_{m = 1}^{M - 1}\; {\sigma_{m}^{(i)}{\prod\limits_{j = {m + 1}}^{M}\; X_{j}^{(i)}}}}} \leq \sigma_{M}^{(i)}} \right)} = {P\left( {{\left( {{\left( {{\left( {X_{1}^{(i)} - \sigma_{1}^{(i)}} \right)X_{2}^{(i)}} - \sigma_{2}^{(i)}} \right)X_{3}^{(i)}} - {\ldots \mspace{14mu} \sigma_{M - 1}^{(i)}}} \right)X_{M}^{(i)}} \leq \sigma_{M}^{(i)}} \right)}}} & (7)\end{matrix}$

The outage probability P_(out) is given by

P _(out) =Pr(max(γ⁽¹⁾,γ⁽²⁾, . . .,γ⁽¹⁾)≦γ_(th))=Pr(γ⁽¹⁾≦γ_(th),γ⁽²⁾≦γ_(th), . . . ,γ⁽¹⁾≦γ_(th))  (8)

The paths are not separable as there are overlap links among the paths.

In the following, a simple network example is used to show how theoptimal paths are found in an embodiment of an amplify-and-forwardmulti-hop relay network to minimize the outage probability.

The network considered below has 4 hops and 3 stages, with two relays ateach stage. Such a network is illustrated in FIG. 2, where thecorresponding parameters (X_(m) ^((i)) and σ_(m) ^((i))) for each stageat each node/link are also given.

It is known from the equations given above that the outage probabilityis given by

$\begin{matrix}{P_{our} = {\Pr \left( {{{\left( {{\left( {{\left( {X_{1}^{(1)} - \sigma_{1}^{(1)}} \right)X_{2}^{(1)}} - \sigma_{2}^{(1)}} \right)X_{3}^{(1)}} - \sigma_{3}^{(1)}} \right)X_{4}^{(1)}} \leq \sigma_{4}},{{\left( {{\left( {{\left( {X_{1}^{(1)} - \sigma_{1}^{(1)}} \right)X_{2}^{(1)}} - \sigma_{2}^{(1)}} \right)X_{3}^{(3)}} - \sigma_{3}^{(2)}} \right)X_{4}^{(2)}} \leq \sigma_{4}},{{\left( {{\left( {{\left( {X_{1}^{(1)} - \sigma_{1}^{(1)}} \right)X_{2}^{(3)}} - \sigma_{2}^{(2)}} \right)X_{3}^{(2)}} - \sigma_{3}^{(1)}} \right)X_{4}^{(1)}} \leq \sigma_{4}},{{\left( {{\left( {{\left( {X_{1}^{(1)} - \sigma_{1}^{(1)}} \right)X_{2}^{(3)}} - \sigma_{2}^{(2)}} \right)X_{3}^{(4)}} - \sigma_{3}^{(2)}} \right)X_{4}^{(2)}} \leq \sigma_{4}},{{\left( {{\left( {{\left( {X_{1}^{(2)} - \sigma_{1}^{(2)}} \right)X_{2}^{(2)}} - \sigma_{2}^{(1)}} \right)X_{3}^{(1)}} - \sigma_{3}^{(1)}} \right)X_{4}^{(1)}} \leq \sigma_{4}},{{\left( {{\left( {{\left( {X_{1}^{(2)} - \sigma_{1}^{(2)}} \right)X_{2}^{(2)}} - \sigma_{2}^{(1)}} \right)X_{3}^{(3)}} - \sigma_{3}^{(2)}} \right)X_{4}^{(2)}} \leq \sigma_{4}},{{\left( {{\left( {{\left( {X_{1}^{(2)} - \sigma_{1}^{(2)}} \right)X_{2}^{(4)}} - \sigma_{2}^{(2)}} \right)X_{3}^{(2)}} - \sigma_{3}^{(1)}} \right)X_{4}^{(1)}} \leq \sigma_{4}},{{\left( {{\left( {{\left( {X_{1}^{(2)} - \sigma_{1}^{(2)}} \right)X_{2}^{(4)}} - \sigma_{2}^{(2)}} \right)X_{3}^{(4)}} - \sigma_{3}^{(2)}} \right)X_{4}^{(2)}} \leq \sigma_{4}}} \right)}} & (9)\end{matrix}$

After some mathematical manipulations, the outage probability can berewritten as

P _(out) =Pr(max(AX ₃ ⁽¹⁾−σ₃ ⁽¹⁾ ,BX ₃ ⁽²⁾−σ₃ ⁽¹⁾)X ₄ ⁽¹⁾≦σ₄,max(AX ₃⁽³⁾−σ₃ ⁽²⁾ ,BX ₃ ⁽⁴⁾−σ₃ ⁽²⁾)X ₄ ⁽²⁾≦σ₄)  (10)

where

A=max((X ₁ ⁽¹⁾−σ₁ ⁽¹⁾)X ₂ ⁽¹⁾−σ₂ ⁽¹⁾,(X ₁ ⁽²⁾−σ₁ ⁽²⁾)X ₂ ⁽²⁾−σ₂⁽¹⁾)  (11)

and

B=max((X ₁ ⁽¹⁾−σ₁ ⁽¹⁾)X ₂ ⁽²⁾−σ₂ ⁽²⁾,(X ₁ ⁽²⁾−σ₁ ⁽²⁾)X ₂ ⁽⁴⁾−σ₂⁽¹⁾)  (12)

It is noted that in the calculation above, the values of A and B areused numerous times and further, once a comparison has taken place todetermine the maximum, for example in the calculation of A or B, inlater calculations, just the maximum quantity is required and thenon-maximum quantity can be discarded.

One can therefore deduce the following algorithm to find the optimalpath for amplify-and-forward multi-hop relay networks with arbitrarynumber of hops and relays.

Consider a general multi-hop network with M stages, where I_(m) relaysare present at the mth stage. The zeroth stage is taken to be the source(I₀=1). The Mth stage is taken to be the destination (I_(M)=1). Thus,I_(m−1) paths lead from each relay in stage m−1 to each relay in stagem. For clarity, each such path is denoted as a branch. There existI_(m−1)I_(m) branches from the (m−1)th stage to the mth stage. In thisembodiment the branches are labelled sequentially in the patternindicated in FIG. 2, but other labelling conventions can be used. Thus,the ith branch gain from the (m−1)th stage to the mth stage is X_(m)^((i)). Moreover, the rth relay in the mth stage is affected by noise,which has a power (scaled by the outage threshold γ_(th)) denoted byσ_(m) ^((r)).

In this embodiment, at the mth relay stage, I_(m−1) branches (one perrelay) connect the (m−1)th relay stage to the rth relay (for r=1, . . ., I_(m)). For the rth relay at the mth stage, these branches have gainsX_(m) ^(((r−1)lm−1+1)), . . . , X_(m) ^((rlm−1)).

Moreover, a path metric is associated with each node at the (m−1)thstage, which is a measure of the quality of choosing said node to routeinformation through. Denote the path metric associated with the qth nodeat the (m−1)th stage as Q_(m−1) ^((q)), with Q₀=1 denoting the pathmetric at the source. The path metric is updated at the rth node of themth relay stage according to the following equation:

Q _(m) ^((r))=max_(q) {Q _(m−1) ^((q)) X _(m) ^(((r−1)lm−1+q))}−σ_(m)^((r))  (13)

In words, the path metric is updated at the rth node of the mth relaystage by considering the product of each path metric and correspondingbranch gain, maximising this quantity, and then subtracting the scalednoise power for the rth node. The path corresponding to the new metricis retained in memory at the mth relay stage.

A person skilled in the art would recognise that the maximisationoperation could also be performed after subtracting the scaled noisepower without altering the outcome of the update procedure.

A method according to an embodiment is summarised as follows. Startingfrom the second stage, at each stage for each node, calculate thecorresponding path metrics for each path, compare the path metrics forthe L incoming paths for each node, reserve the path that has thelargest path metric while discarding all the others. Therefore, only oneroute is reserved for each node at a given stage. This process repeatsuntil the destination node is arrived at. The algorithm then traces backto find the optimal route and outputs the survivor path.

Below an example of the above method is described with reference toFIGS. 3 a-g.

FIG. 3 a shows example values for the variables used in thedetermination of an optimum path for transmitting a message through anetwork 300 from the source node 301 to the destination node 341.

FIG. 3 b shows the first step in the method. The first step is tocalculate the path metrics for the two incoming paths for the first node321 at the second stage. The path metric for the path via the first node311 at the first stage is (1−0.1)*1 and the path metric for the path viathe second node 312 at the first stage is (4−0.2)*3. The two pathmetrics are compared and the second incoming path for the first node 321at stage 2 is selected (the path via the second node 312), and an outputof (4−0.2)*3=11.4 is put in the memory of the first node 321. The pathvia the first node 311 in the first stage is discarded and is shown as adashed line in FIG. 3 b.

FIG. 3 c shows the second step in the method. In the second step pathmetrics for the two incoming paths for the second node 322 arecalculated. These are (1−0.1)*2 for the path via the first node 311 atthe first stage and (4−0.2)*4 for the path via the second node 312 atthe first stage. These are then compared and the second incoming pathfor the second node at stage 2 is selected, that is the path via thesecond node 312 at the first stage. An output of (4−0.2)*4=15.2 is putin the memory of the second node 322 at the second stage.

FIG. 3 d shows the third step in the method. The path metrics for thetwo incoming paths for the first node 331 at the third stage arecomputed. These are computed using the path metrics calculated by thenodes in the previous stage. The path metrics are calculated as(11.4−0.3)*4 for the path via the first node 321 in the second stage andas (15.2−0.4)*2 for the path via the second node 322 in the secondstage. The calculated path metrics are compared and the first incomingpath for the first node at stage 3 (the path via the first node 321 inthe second stage) is selected, and an output of (11.4−0.3)*4=44.4 is putin the memory of the first node 331.

FIG. 3 e shows the fourth step in the method. The path metrics for thetwo incoming paths for the second node 332 at the third stage arecalculated. These are calculated as (11.4−0.3)*3 for the path via thefirst node 321 in the second stage and as (15.2−0.4)*1 for the secondnode in the second stage 322. The calculated path metrics are comparedand the first incoming path (that is the path via the first node 321 atthe second stage) for the second node 332 at stage 3 is selected, and anoutput of (11.4−0.3)*3=33.3 is put in the memory of the second node 332.

FIG. 3 f shows the fifth step. In the fifth step, the path metrics forthe two incoming paths for the destination node 341 at the final stageare calculated. These are (44.4−0.5)*1 for the path via the first node331 at the third stage and (33.3−0.6)*2 for the path via the second node332 at the third stage. These two path metrics are compared and thesecond incoming path (the path via the second node 332) for thedestination node 341 is selected.

FIG. 3 g shows the sixth step. In the sixth step, the survivor path istraced back and selected as the optimal route.

It is noted that only the parameters shown in the figures are requiredfor each of the steps. So each node only requires information about thechannel to the preceding nodes and the path metric for the path up tothe preceding node.

FIG. 4 shows a wireless relay device 400 according to an embodiment. Thewireless relay device 400 has a receiver 402 and a transmitter 404. Inuse, the wireless relay device receives signals at the receiver 402 andtransmits signals based on the received signals with the transmitter404. In embodiments, the wireless relay device 400 is anamplify-and-forward relay device and includes an amplifier to amplifythe received signal before it is transmitted.

The wireless relay device 400 comprises a processor 406 which isoperable to execute machine code instructions. The processor 406 isshown executing instructions 408 for path metric calculation inaccordance with the methods described above. The wireless relay device400 comprises a memory 410 which is stores an indication 412 of themaximum path metric calculated according to the methods described above.

In use, the wireless relay device 400 receives indications from otherwireless devices, which may be other wireless relay devices or may be adevice acting as a source node. The indications include a path metricfor a message to be transmitted through a wireless network of which thewireless relay device 400 is a part. The processor 406 of the wirelessrelay device uses the indications to determine the maximum path metricfor all of the incoming paths and stores an indication of the maximumpath metric in the memory 410. The transmitter 404 transmits anindication of the maximum path metric to other nodes of the wirelessnetwork.

Thus the wireless relay device 400 facilitates the selection of a paththrough the wireless network. The wireless relay device may store anindication of the path having the maximum path metric to facilitatetracing back of the optimal path once the calculation has reached theproposed destination node.

While the path metric calculation instructions are illustrated as adistinct software element, the reader will appreciate that software canbe introduced to a computer in a number of different ways. For instance,a computer program product, consisting of a storage medium could beintroduced to a computer, so that stored instructions can then betransferred to the computer. Equally, a signal could be sent to thecomputer bearing such instructions. Furthermore, in introducing acomputer program product, the reader will appreciate that a piece ofsoftware may be composed of a number of components, some of which may benew, and others of which may be assumed to be provided in the computeralready. For instance, a computer might be reasonably assumed to besupplied with an operating system of known type, and a computer programmay be developed on the basis of the presence of such an operatingsystem. The interaction between the computer program developed in thatway, and facilities of the operating system, would lead to thedefinition of a communications facilities element such as illustrated inFIG. 4. Thus, any computer program product may be developed as a new,stand-alone product, or as a plug-in to existing products.

FIG. 5 is a flow chart illustrating a method 500 of transmitting amessage from a source node to a destination node according to anembodiment.

In step S502 the method starts when the source node requires a messageto be transmitted to the destination node.

In step S504, the calculation moves to the first relay node. In stepS506, the relay node receives indications of path metrics for paths fromthe source node to the node under consideration.

In step S508, the relay node determines the maximum path metric for apath from the source node to the relay node under consideration. Thismay be determined using equation (13) described above.

In step S510, the maximum path metric is transmitted to the nodes in thenext stage.

If the next stage includes the destination node, then the calculationmoves to step S514 which is carried out by the destination node. If thenext stage does not include the destination node then the method movesto the next relay node in S512 and steps S506-S510 are repeated at thatrelay node.

When step S514 is reached (when the calculation reaches the destinationnode), the path having the maximum path metric is determined and tracedback to the source node from the destination node. Each node may storean indication of the relay node in the previous stage that correspondsto the path having the maximum path metric to facilitate the tracingback of the optimum path.

Once the optimum path has been traced back, the message is transmittedfrom the source node to the destination node in step S516.

For a network with M hops and L relay nodes at each hop, with anexhaustive search, there are L^((M−1)) paths to compare. For each path,the end-to-end SNR needs to be computed (γ^((i))), and global knowledgeof the channel state information for each link at each stage is requiredin order to compute these SNR values and perform the comparisons.

In embodiments using the proposed path selection algorithm, in theintermediate M−2 stages, L² comparisons are needed for each stage, and Lcomparisons are needed for the last stage at the destination node. Thetotal number of comparisons are therefore L²(M−2)+L, which is muchsmaller than L^((M−1)) especially in large scale networks when L and Mare large.

FIG. 6 illustrates the number of comparisons required for different Mfor exhaustive search and the path selection algorithm used inembodiments.

FIG. 7 illustrates the number of comparisons required for different Lfor exhaustive search and the path selection algorithm used inembodiments.

In addition, compared to using exhaustive search, no global channelinformation is required in order to find the optimal path by usingembodiments. For each node, only the channel state information betweenthe previous stage and the current stage of all the incoming paths tothis node is required. In another words, only the channel stateinformation at the receiver is required at each relay node.

Embodiments using the algorithm described herein have the advantage oflow complexity.

One of the reasons for this is that in embodiments each node sends anindication of a path metric for a single path to the nodes in the nextstage. This makes the embodiments which use the algorithm scalable sincethe complexity does not greatly increase when the number of nodes isincreased.

FIG. 8 shows a comparision of the outage probability for paths selectedby embodiments of methods described above and for exhaustive search.This shows that embodiments can achieve the same performance in terms ofoutage probability as an exhaustive search.

Embodiments are applicable to relay networks with arbitrary number (notnecessarily equal) number of relays at each stage, and for any fadingchannels.

Further, embodiments allow for path selection for relay systems withmultiple source/destination nodes. In such a case one source node canperform the path selection first, followed by the path selection of asecond source node. These embodiments implement the greedy algorithm. Insome application scenarios such as the delay-tolerant networks, sourcenodes can be scheduled in a way that guarantees no overlaps among thepaths they selected (in time, frequency, or space domain).

While certain embodiments have been described, these embodiments havebeen presented by way of example only, and are not intended to limit thescope of the inventions. Indeed, the novel methods, systems, devices andnetworks described herein may be embodied in a variety of other forms;furthermore, various omissions, substitutions and changes may be madewithout departing from the spirit of the inventions. For example,alternative fixed gain amplification factors to that given in equation(4) could be used. The accompanying claims and their equivalents areintended to cover such forms or modifications as would fall within thescope and spirit of the inventions.

1. A wireless relay device comprising a receiver configured to receivesignals from at least a first wireless device and a second wirelessdevice, and to extract, from a signal received from the first wirelessdevice, an indication of a path metric for a path from a source node tothe first wireless device, and from a signal received from the secondwireless device, an indication of a path metric for a path from thesource node to the second wireless device; a processor configured toselect, using the extracted indications, a path from the source node tothe wireless relay device and to determine a path metric for theselected path; a memory configured to store the path metric for theselected path; and a transmitter configured to transmit an indication ofthe path metric for the selected path to a third wireless device.
 2. Awireless device according to claim 1 wherein the processor is configuredto use the extracted indications to determine, an optimal path, from aset of paths comprising the path from the source node to the wirelessrelay device via the first wireless device and the path from the sourcenode to the wireless relay device via the second wireless device, and toselect the optimal path.
 3. A wireless device according to claim 1wherein the processor is configured to use indications of channel stateinformation for, respectively, a path between the first wireless deviceand the wireless relay device, and a path between the second wirelessdevice and the wireless relay device and the extracted indications toselect a path from the source node to the wireless relay device.
 4. Awireless device according to claim 1 wherein the processor is configuredto use indications of the effective gain for, respectively, a pathbetween the first wireless device and the wireless relay device, and apath between the second wireless device and the wireless relay deviceand the extracted indications to select a path from the source node tothe wireless relay device.
 5. A wireless relay device according to claim4, wherein the processor is configured to determine the path metric forthe selected path as the effective gain for the path from one of thefirst and the second wireless device to the wireless relay devicemultiplied by the path metric for the path from the source node to theone of the first and the second wireless device minus a quantityproportional to the noise power on the wireless relay device.
 6. Awireless relay device according to claim 1, wherein the processor isconfigured to calculate a set of products, the set of productscomprising for each of the first and the second wireless device theproduct of the effective channel gain for the path from the wirelessdevice to the wireless relay device multiplied with the path metric forthe path from the source node to that wireless device, to compare theproducts of the set of products to determine a largest product, and toselect the path having the largest product as the selected path.
 7. Awireless relay device according to claim 1 configured as anamplify-and-forward wireless relay device.
 8. A wireless relay deviceaccording to claim 7 configured as a fixed gain amplify-and-forwardwireless relay device.
 9. A wireless network comprising a source node; adestination node; and a plurality of wireless relay devices according toclaim 1, wherein the destination node is configured to receiveindications of path metrics from at least a first wireless relay deviceand a second wireless relay device of the plurality of wireless relaydevices; determine, using the received path metrics, an optimal pathfrom the source node to the destination node.
 10. A wireless networkaccording to claim 9, configured to send a message along the optimalpath from the source node to the destination node.
 11. A wirelesscommunication method comprising receiving, at a wireless relay device,signals from at least a first wireless device and a second wirelessdevice, wherein a signal received from the first wireless devicecomprises an indication of a path metric for a path from a source nodeto the first wireless device and a signal received from the secondwireless device comprises an indication of a path metric for a path fromthe source node to the second wireless device; using the indicationsreceived from the first wireless device and the second wireless deviceto select a path from the set of paths comprising the path from thesource node to the wireless relay device via the first wireless deviceand the path from the source node to the wireless relay device via thesecond wireless device; determining a path metric for the selected path;and transmitting an indication of the path metric for the selected pathto a third wireless device.
 12. A wireless communication methodaccording to claim 11, comprising determining an optimal path from theset of paths and selecting the optimal path.
 13. A wirelesscommunication method according to claim 11, wherein determining a pathmetric for the selected path comprises multiplying the effective gainfor the path from one of the first and the second wireless device to thewireless relay device by the path metric for the path from the sourcenode to the one of the first and the second wireless device andsubtracting a quantity proportional to the noise power on the wirelessrelay device.
 14. A wireless communication method according to claim 13,selecting a path comprises calculating a set of products, the set ofproducts comprising for each of the first and the second wireless devicethe product of the effective channel gain for the path from the wirelessdevice to the wireless relay multiplied with the path metric for thepath from the source node to that wireless device, comparing theproducts of the set of products to determine a maximum product, andselecting the path having the maximum product.
 15. A method of selectinga path from a source node to a destination node in a wireless network,the method comprising at a first relay node determining a maximum pathmetric for paths from the source node to the first relay node, selectingthe path having the maximum path metric as an optimum path from thesource node to the first relay node, at a second relay node determininga maximum path metric for paths from the source node to the second relaynode, selecting the path having the maximum path metric as an optimumpath from the source node to the second relay node, receiving anindication of the path metric for the optimum path from the source nodeto the first relay node and an indication of the path metric for theoptimum path from the source node to the second relay node at thedestination node; determining, at the destination node, the path fromthe source node to the destination node having the maximum path metricusing the indication of the path metric for the optimum path from thesource node to the first relay node and the indication of the pathmetric for the optimum path from the source node to the second relaynode at the destination node; and selecting the path having the maximumpath metric as the optimum path from the source node to the destinationnode.
 16. A method according to claim 15, further comprisingtransmitting a message along the optimum path.
 17. A computer programproduct comprising computer readable instructions which when executed ona processor cause the processor to perform a method according to claim11.